Computational experience with an algorithm for 0–1 integer programming

Computational experience with a group theoretic integer programming algorithm

Computational Experience with a Software Framework for Parallel Integer Programming

In this paper, we discuss the challenges that arise in parallelizing algorithms for solving mixed integer linear programs and introduce a software framework that aims to address these challenges. The framework was designed specifically with support for implementation of relaxationbased branch-and-bound algorithms in mind. Achieving efficiency for such algorithms is particularly challenging and ...

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

An Evolutionary Algorithm for Integer Programming

The mutation distribution of evolutionary algorithms usu ally is oriented at the type of the search space Typical examples are binomial distributions for binary strings in genetic algorithms or normal distributions for real valued vectors in evolution strategies and evolu tionary programming This paper is devoted to the construction of a mutation distribution for unbounded integer search spaces...

A Group Theoretic Integer Programming Algorithm: System Design and Computational Experience